An improved pair-wise exchange heuristic for the dynamic plant layout problem
نویسندگان
چکیده
منابع مشابه
An Improved Pair-wise Exchange Heuristic for the Dynamic Plant Layout Problem
Much of the research in facility layout has focused on static layouts where the material handling flow is assumed to be constant during the planning horizon. But in today’s market-based, dynamic environment, layout rearrangement may be required during the planning horizon to maintain layout effectiveness. A few algorithms have been proposed to solve this problem. They include dynamic programmin...
متن کاملMulti-start simulated annealing for dynamic plant layout problem
In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملmulti-start simulated annealing for dynamic plant layout problem
in today’s dynamic market, organizations must be adaptive to market fluctuations. in addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...
متن کاملAn Improved Test Generation Algorithm for Pair-Wise Testing
Pair-wise or two-way interaction testing requires that for a given numbers of input parameters to the system, each possible combination of values for any pair of parameters be covered by at least one test. Empirical results show that pair-wise testing is practical and efficient for various types of software systems [1]. The problem of generating a minimum test set for pair-wise testing is NP-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2000
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207540050117440